Automated Generation of Analytic Calculi for Logics with Linearity
نویسنده
چکیده
We show how to automatically generate analytic hypersequent calculi for a large class of logics containing the linearity axiom (lin) (A ⊃ B) ∨ (B ⊃ A) starting from existing (single-conclusion) cut-free sequent calculi for the corresponding logics without (lin). As a corollary, we define an analytic calculus for Strict Monoidal T-norm based Logic SMTL.
منابع مشابه
Tools for the Investigation of Substructural, Intermediate and Paraconsistent Logics
Non-classical logics have gained importance in many fields of computer science, engineering and philosophy. They are often employed in applications of artificial intelligence, knowledge representation and formal verification; e.g., when it comes to reasoning in presence of vague information or inconsistencies. There are already many non-classical logics and, due to the increasing demand for suc...
متن کاملAutomated Support for the Investigation of Paraconsistent and Other Logics
We automate the construction of analytic sequent calculi and effective semantics for a large class of logics formulated as Hilbert calculi. Our method applies to infinitely many logics, which include the family of paraconsistent C-systems, as well as to other logics for which neither analytic calculi nor suitable semantics have so far been available.
متن کاملNested Sequent Calculi and Theorem Proving for Normal Conditional Logics
In this paper we focus on proof methods and theorem proving for normal conditional logics, by describing nested sequent calculi as well as a theorem prover for them. Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain ...
متن کاملAnalytic Calculi for Non-Classical Logics: Theory and Applications
The possession of a suitable proof-calculus is the starting point for many investigations into a logic, including decidability and complexity, computational interpretations and automated theorem proving. By suitable proof-calculus we mean a calculus whose proofs exhibit some notion of subformula property (‘analyticity’). In this talk we describe a method for the algorithmic introduction of anal...
متن کاملDissertation Abstract Semantic Investigation of Proof Systems for Non-classical Logics
Ever since the introduction of sequent calculi for classical and intuitionistic logic by Gentzen [20], sequent calculi have been widely applied in the fields of proof theory, computational logic, and automated deduction. These systems and their natural generalizations (such as many-sided sequent and hypersequent calculi) provide suitable proof-theoretic frameworks for a huge variety of non-clas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004